On the Deterministic Horn Fragment of Test-free PDL
نویسنده
چکیده
Motivation Horn fragments of logics are useful: 1. They usually allow bottom-up evaluation. 2. They usually eliminate nondeterminism. 3. They form basis for logic programming.
منابع مشابه
Separation of Test-Free Propositional Dynamic Logics over Context-Free Languages
For a class L of languages let PDL[L] be an extension of Propositional Dynamic Logic which allows programs to be in a language of L rather than just to be regular. If L contains a non-regular language, PDL[L] can express non-regular properties, in contrast to pure PDL. For regular, visibly pushdown and deterministic context-free languages, the separation of the respective PDLs can be proven by ...
متن کاملPDL Inside the ?-calculus: A Syntactic and an Automata-theoretic Characterization
It is well known that Propositional Dynamic Logic (PDL) can be seen as a fragment of the modal μ-calculus. In this paper we provide an exact syntactic characterization of the fragments of the μ-calculus that correspond to PDL and to test-free PDL. In addition we give automata-theoretic characterizations for PDL, with and without tests, which shed light on the relation between these logics and t...
متن کاملA Bottom-Up Method for the Deterministic Horn Fragment of the Description Logic ALC
We study the deterministic Horn fragment of ALC, which restricts the general Horn fragment of ALC only in that, the constructor ∀R.C is allowed in bodies of program clauses and queries only in the form ∀∃R.C, which is defined as ∀R.C u ∃R.C. We present an algorithm that for a deterministic positive logic program P given as a TBox constructs a finite least pseudo-model I of P such that for every...
متن کاملDeciding Properties of Nonregular Programs
Extensions of propositional dynamic logic (PDL) with nonregular programs are considered. Three classes of nonregular languages are defined, and for each of them it is shown that for any language L in the class, PDL, with L added to the set of regular programs as a new program, is decidable. The first class consists of the languages accepted by pushdown automata that act only on the basis of the...
متن کاملVerification of non-regular program properties
Most temporal logics which have been introduced and studied in the past decades can be embedded into the modal Lμ. This is the case for e.g. PDL, CTL, CTL , ECTL, LTL, etc. and entails that these logics cannot express non-regular program properties. In recent years, some novel approaches towards an increase in expressive power have been made: Fixpoint Logic with Chop enriches Lμ with a sequenti...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006